Contrast-optimal k out of n secret sharing schemes in visual cryptography
نویسندگان
چکیده
منابع مشابه
Constructions and Properties of k out of n Visual Secret Sharing Schemes
The idea of visual k out of n secret sharing schemes was introduced in [?]. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described. Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bou...
متن کاملContrast Optimal Threshold Visual Cryptography Schemes
A (k; n)-threshold visual cryptography scheme ((k; n)-threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the \visual" recovery of the secret image, but by inspecting less that k share one cannot gain any information on the secret image. The \visual" recovery consists of xeroxing the shares onto transparencie...
متن کاملVisual Cryptography Schemes for Secret Image Sharing using GAS Algorithm
Visual Cryptography Schemes (VCS) is a method of image encryption used to hide the secret information in images. In the traditional VCS, the secret image is encrypted into n number of shares randomly and distributed to the n number of participates. The secret image can be recovered simply by stacking the shares without any complex computation involved. However previous approach suffers a securi...
متن کاملReal Perfect Contrast Visual Secret Sharing Schemes with Reversing
The visual secret sharing (VSS for short) scheme is a secret image sharing scheme. A secret image is visually revealed from overlapping shadow images without additional computations. However, the contrast of reconstructed image is much lost. By means of the reversing operation (reverse black and white), Viet and Kurosawa used the traditional VSS scheme to design a VSS scheme which the secret im...
متن کاملThe Optimal n - out - of - n Visual Secret Sharing Scheme for Gray - Scale Images ∗
In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n, n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n, n)-VSS-GS scheme can be constructed based on the socalled polynomial representation of basis matrices treated in [15], [16]. Furthermore, it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00243-1